By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 16, Issue 5, pp. 779-972

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning $\omega $-Machines

Louis E. Rosier and Hsu-Chun Yen

pp. 779-807

BibTeX  Abstract Full Text:  PDF

Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones

Helmut Alt, Torben Hagerup, Kurt Mehlhorn, and Franco P. Preparata

pp. 808-835

BibTeX  Abstract Full Text:  PDF

A DNF without Regular Shortest Consensus Path

Wenqi Huang and Xiangdong Yu

pp. 836-840

BibTeX  Abstract Full Text:  PDF

Independent and Separable Database Schemes

Edward P. F. Chan and Alberto O. Mendelzon

pp. 841-851

BibTeX  Abstract Full Text:  PDF

A Note on Randomized Polynomial Time

Stuart A. Kurtz

pp. 852-853

BibTeX  Abstract Full Text:  PDF

Doubly Lexical Orderings of Matrices

Anna Lubiw

pp. 854-879

BibTeX  Abstract Full Text:  PDF

The Parallel Complexity of Abelian Permutation Group Problems

Pierre McKenzie and Stephen A. Cook

pp. 880-909

BibTeX  Abstract Full Text:  PDF

Nonlinear Algebra and Optimization on Rings are "Hard"

H. B. Hunt, III and R. E. Stearns

pp. 910-929

BibTeX  Abstract Full Text:  PDF

Computing Powers in Parallel

Joachim von zur Gathen

pp. 930-945

BibTeX  Abstract Full Text:  PDF

On the Optimal Layout of Planar Graphs with Fixed Boundary

B. Becker and G. Hotz

pp. 946-972

BibTeX  Abstract Full Text:  PDF